How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition

نویسندگان

چکیده

We propose a technique to construct physical Zero-Knowledge Proof (ZKP) protocols for puzzles that require single loop draw feature. Our approach is based on the observation has only one hole and this property remains stable by some simple transformations. Using trick, we can transform big loop, which visible anyone, into solution using transformations do not disclose any information about solution. illustrate our applying it ZKP two Nikoli puzzles: Slitherlink Masyu.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen

Akari, Takuzu, Kakuro and KenKen are logic games similar to Sudoku. In Akari, a labyrinth on a grid has to be lit by placing lanterns, respecting various constraints. In Takuzu a grid has to be filled with 0’s and 1’s, while respecting certain constraints. In Kakuro a grid has to be filled with numbers such that the sums per row and column match given values; similarly in KenKen a grid has to b...

متن کامل

a new approach to credibility premium for zero-inflated poisson models for panel data

هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...

15 صفحه اول

A Survey of Zero-Knowledge Proofs with Applications to Cryptography

Zero-knowledge proofs are proofs that show a statement to be true without revealing anything other than the veracity of the statement to be proven. After a formal definition of zero-knowledge proof schemes and a simple example, zero-knowledge proofs for Graph Isomorphism and Graph 3-colorability are presented, the latter being the basis for the proof that all languages in NP have zero-knowledge...

متن کامل

Some Zero-Knowledge Proofs

Consider a general proof system for a language in NP. That is, suppose we have a language L 2 NP and a string x 2 L. For example, let L be GRAPH-ISOMORPHISM and x = (G0; G1) a pair of isomorphic graphs. Suppose Victor is not convinced that x 2 L, so he calls his friend Peggy (who is infinitely powerful) and asks for a proof. Peggy agrees, because she’s nice that way, applies her infinite power,...

متن کامل

Zero-Knowledge Identity Proofs

The problem of proving identity, according to Bishop in [2], can generally be solved using some of the following things: (1) something you know (like a password), (2) something you have (like an identification badge), (3) something you are (such as a fingerprint), and (4) where you are (such as your computer’s internet address). Many identification schemes focus on the first problem, proving kn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2021

ISSN: ['1879-2294', '0304-3975']

DOI: https://doi.org/10.1016/j.tcs.2021.07.019